Decorated Tangles and Canonical Bases
نویسنده
چکیده
We study the combinatorics of fully commutative elements in Coxeter groups of type H n for any n > 2. Using the results, we construct certain canonical bases for non-simply-laced generalized Temperley{Lieb algebras and show how to relate them to morphisms in the category of decorated tangles.
منابع مشابه
A ug 2 00 1 DECORATED TANGLES AND CANONICAL BASES
We study the combinatorics of fully commutative elements in Coxeter groups of type H n for any n > 2. Using the results, we construct certain canonical bases for non-simply-laced generalized Temperley–Lieb algebras and show how to relate them to morphisms in the category of decorated tangles.
متن کاملOn the Counting of Colored Tangles
The connection between matrix integrals and links is used to define matrix models which count alternating tangles in which each closed loop is weighted with a factor n, i.e. may be regarded as decorated with n possible colors. For n = 2, the corresponding matrix integral is that recently solved in the study of the random lattice six-vertex model. The generating function of alternating 2-color t...
متن کاملWoven Geometries: Black Holes
Tangles of loops which approximate an aspect of the Kerr-Newman black hole metrics at large scales compared to the Planck length are constructed. The physical aspect the tangles approximate is discussed. This construction may be useful in the loop representation of canonical quantum gravity. Implications and applications of the tangles are remarked.
متن کاملTangled up in Blue (A Survey on Connectivity, Decompositions, and Tangles)
We survey an abstract theory of connectivity, based on symmetric submodular set functions. We start by developing Robertson and Seymour’s [44] fundamental duality theory between branch decompositions (related to the better-known tree decompositions) and so-called tangles, which may be viewed as highly connected regions in a connectivity system. We move on to studying canonical decompositions of...
متن کاملFinal Semantics for Decorated Traces
In concurrency theory, various semantic equivalences on labelled transition systems are based on traces enriched or decorated with some additional observations. They are generally referred to as decorated traces, and examples include ready, failure, trace and complete trace equivalence. Using the generalized powerset construction, recently introduced by a subset of the authors [13], we give a c...
متن کامل